Computational Alignment: a New, Uniied Program Transformation for Local and Global Optimization
نویسندگان
چکیده
Computational Alignment is a new class of program transformations suitable for both local and global optimization. Computational Alignment transforms all of the computations of a portion of the loop body in order to align them to other computations either in the same loop or in another loop. It extends along a new dimension and is signiicantly more powerful than linear transformations because i) it can transform subsets of dependences and references; ii) it is sensitive to the location of data in that it can move the computation relative to data; iii) it applies to imperfect loop nests; and iv) it is the rst loop transformation that can change access vectors. Linear transformations are just a special case of Computational Alignment. Computational Alignment is highly suitable for global optimization because it can transform given loops to access data in similar ways. Two important subclasses of Computational Alignment are presented as well, namely, Freeing and Isomerizing Computational Alignment.
منابع مشابه
Computational Alignment: a New, Uniied Program Transformation for Local and Global Optimization Computational Alignment: a New, Uniied Program Transformation for Local and Global Optimization
Computational Alignment is a new class of program transformations suitable for both local and global optimization. Computational Alignment transforms all of the computations of a portion of the loop body in order to align them to other computations either in the same loop or in another loop. It extends along a new dimension and is signiicantly more powerful than linear transformations because i...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملIndex-based Search of Single Sequences
Computational approaches to sequence alignment fall into two categories: local alignment and global alignment. Global alignment is a form a global optimization that forces the alignment to span the entire length of all query sequences. On the other hand, local alignments identify regions of similarity within long sequences that are often widely divergent overall. Local alignments can be difficu...
متن کاملA Direct Search Algorithm for Global Optimization
A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is d...
متن کاملOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کامل